<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"
            "http://www.w3.org/TR/REC-html40/loose.dtd">
<HTML>
<HEAD>



<META http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<META name="GENERATOR" content="hevea 1.08">
<LINK rel="stylesheet" type="text/css" href="tutorial.css">
<TITLE>
Hybridisation Support
</TITLE>
</HEAD>
<BODY >
<A HREF="tutorial050.html"><IMG SRC ="previous_motif.gif" ALT="Previous"></A>
<A HREF="tutorial046.html"><IMG SRC ="contents_motif.gif" ALT="Up"></A>
<A HREF="tutorial052.html"><IMG SRC ="next_motif.gif" ALT="Next"></A>
<HR>

<H2 CLASS="section"><A NAME="htoc110">7.5</A>&nbsp;&nbsp;Hybridisation Support</H2><UL>
<LI><A HREF="tutorial051.html#toc61">Repair and Local Search: <EM>repair</EM></A>
<LI><A HREF="tutorial051.html#toc62">Hybrid: <EM>ic_probing_for_scheduling</EM></A>
</UL>

<A NAME="toc61"></A>
<H3 CLASS="subsection"><A NAME="htoc111">7.5.1</A>&nbsp;&nbsp;Repair and Local Search: <EM>repair</EM></H3>
<A NAME="@default180"></A>
<A NAME="shortsecrepair"></A>
The <EM>repair</EM> library allows a <EM>tentative</EM> value to be
associated with any variable [<A HREF="tutorial133.html#cp99wkshoptalk"><CITE>28</CITE></A>].
This tentative value may violate constraints on the variable, in which
case the constraint is recorded in a list of violated constraints.
The repair library also supports propagation <EM>invariants</EM>
[<A HREF="tutorial133.html#Localizer"><CITE>18</CITE></A>].
Using invariants, if a variable's tentative
value is changed, the consequences of this change can be propagated to
any variables whose tentative values depend on the changed one.
The use of tentative values in search is illustrated in chapter <A HREF="tutorial091.html#chaprepair">13</A>.<BR>
<BR>
<A NAME="toc62"></A>
<H3 CLASS="subsection"><A NAME="htoc112">7.5.2</A>&nbsp;&nbsp;Hybrid: <EM>ic_probing_for_scheduling</EM></H3>
<A NAME="@default181"></A>
<A NAME="shortsecprobing"></A>
For scheduling applications where the cost is dependent on each start
time, a combination of solvers can be very powerful.
For example, we can use finite domain
propagation to reason on 
resources and linear constraint solving to reason on cost [<A HREF="tutorial133.html#HaniProbe"><CITE>7</CITE></A>].
The <EM>probing_for_scheduling</EM> library supports such a combination,
via a similar user interface to the <EM>cumulative</EM> constraint mentioned
above in section <A HREF="tutorial048.html#secglobalcstr">7.2.3</A>.
For more details see chapter <A HREF="tutorial121.html#chaphybrid">17</A>.<BR>
<BR>
<HR>
<A HREF="tutorial050.html"><IMG SRC ="previous_motif.gif" ALT="Previous"></A>
<A HREF="tutorial046.html"><IMG SRC ="contents_motif.gif" ALT="Up"></A>
<A HREF="tutorial052.html"><IMG SRC ="next_motif.gif" ALT="Next"></A>
</BODY>
</HTML>
